package com.example.algorithm.tree.heap;

public class HeapTest {
    public static void main(String[] args) {
        Heap<String> heap = new Heap<>(10);
        heap.insert("A");
        heap.insert("B");
        heap.insert("C");
        heap.insert("D");
        heap.insert("E");
        heap.insert("F");
        heap.insert("G");

        String res = null;
        while ((res = heap.delMax()) != null){
            System.out.println(res);
        }
    }
}
